I(FIB)F: Iterated Bloom Filters for Routing in Named Data Networks

摘要

Named Data Networks provide a clean-slate redesign of the Future Internet forefficient content distribution. Because Internet of Things are expected tocompose a significant part of Future Internet, most content will be managed byconstrained devices. Such devices are often equipped with limited CPU, memory,bandwidth, and energy supply. However, the current Named Data Networks designneglects the specific requirements of Internet of Things scenarios and manydata structures need to be further optimised. The purpose of this research isto provide an efficient strategy to route in Named Data Networks byconstructing a Forwarding Information Base using Iterated Bloom Filters definedas I(FIB)F. We propose the use of content names based on iterative hashes. Thisstrategy leads to reduce the overhead of packets. Moreover, the memory and thecomplexity required in the forwarding strategy are lower than in currentsolutions. We compare our proposal with solutions based on hierarchical namesand Standard Bloom Filters. We show how to further optimise I(FIB)F byexploiting the structure information contained in hierarchical content names.Finally, two strategies may be followed to reduce: (i) the overall memory forrouting or (ii) the probability of false positives.